Maximum number of colorings of (2k, k2)-graphs
نویسندگان
چکیده
Let F2k,k2 consist of all simple graphs on 2k vertices and k2 edges. For a simple graph G and a positive integer λ, let PG(λ) denote the number of proper vertex colorings of G in at most λ colors, and let f(2k, k2, λ) = max{PG(λ) : G ∈ F2k,k2}. We prove that f(2k, k2, 3) = PKk,k(3) and Kk,k is the only extremal graph. We also prove that f(2k, k2, 4) = (6 + o(1))4k as k →∞.
منابع مشابه
Negative results on acyclic improper colorings
Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number k is at most k2. We prove that this bound is tight for k ≥ 3. We also consider acyclic improper colorings on planar graphs and partial ktrees. Finally, we show that some improper and/or acyclic colorings are NP-complete on restricted subclasses of planar graphs, in particular acyclic 3-colorabi...
متن کاملM2-edge Colorings of Dense Graphs
An edge coloring φ of a graph G is called an Mi-edge coloring if |φ(v)| ≤ i for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we establish some bounds of K2(G), present some graphs achieving the bounds and determine exact values of K2(G) for dense graphs.
متن کاملExtremal H-colorings of trees and 2-connected graphs
For graphs G and H, an H-coloring of G is an adjacency preserving map from the vertices of G to the vertices of H. H-colorings generalize such notions as independent sets and proper colorings in graphs. There has been much recent research on the extremal question of finding the graph(s) among a fixed family that maximize or minimize the number of H-colorings. In this paper, we prove several res...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملMi-Edge Colorings of Graphs
An edge coloring of a graph G is called Mi-edge coloring if at most i colors appear at any vertex of G. Let Ki(G) denote the maximum number of colors used in an Mi-edge coloring of G. In this paper we determine the exact value of K2(G) for any graph G of maximum degree at most 3. Mathematics Subject Classification: 05C15, 05C38
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 56 شماره
صفحات -
تاریخ انتشار 2007